A mechanical counting method and combinatorial applications
نویسندگان
چکیده
منابع مشابه
Counting combinatorial choice rules
I count the number of combinatorial choice rules that satisfy certain properties: Kelso–Crawford substitutability, and independence of irrelevant alternatives. The results are important for two-sided matching theory, where agents are modeled by combinatorial choice rules with these properties. The rules are a small, and asymptotically vanishing, fraction of all choice rules. But they are still ...
متن کاملUnhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebraic (relating the products of eigenvalues of the graphs’ adjacency matrices) and not combinatorial. In this paper we derive a straightforward combinatorial proof of this fact. Instead of trying to decompose a large circu...
متن کاملA Combinatorial Identity and Applications
An identity for the finite sum ∑N 1 z qn−r is given. Related sums (or series) were studied by Scherk, Clausen, Ramanujan, Shanks, Andrews, and others. We use such identity to give new formulas for ∑∞ 1 z qn−r , the Riemann zeta function and the Euler–Mascheroni constant. An irrationality result is also proved.
متن کاملOn a combinatorial method for counting smooth numbers in sets of integers
In this paper we develop a method for determining the number of integers without large prime factors lying in a given set S. We will apply it to give an easy proof that certain sufficiently dense sets A and B always produce the expected number of “smooth” sums a + b, a ∈ A, b ∈ B. The proof of this result is completely combinatorial and elementary.
متن کاملA Combinatorial Method for Counting Smooth Numbers in Sets of Integers
Given a set S, a common question one tries to answer is whether S contains the expected number of “y-smooth” integers, which are those integers having no prime divisors greater than y. We denote the number of integers in S with this property by Ψ(S, y); and for a number x > 0, one denotes the set of all y-smooths positive integers ≤ x by Ψ(x, y). So, Ψ({1, 2, ..., ⌊x⌋}, y) = Ψ(x, y). If S ⊆ {1,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1968
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(68)80006-7